Verification of population protocols
نویسندگان
چکیده
منابع مشابه
automatic verification of authentication protocols using genetic programming
implicit and unobserved errors and vulnerabilities issues usually arise in cryptographic protocols and especially in authentication protocols. this may enable an attacker to make serious damages to the desired system, such as having the access to or changing secret documents, interfering in bank transactions, having access to users’ accounts, or may be having the control all over the syste...
15 صفحه اولAlgorithmic Verification of Population Protocols
In this work, we study the Population Protocol model of Angluin et al. from the perspective of protocol verification. In particular, we are interested in algorithmically solving the problem of determining whether a given population protocol conforms to its specifications. Since this is the first work on verification of population protocols, we redefine most notions of population protocols in or...
متن کاملTowards Efficient Verification of Population Protocols
Population protocols are a well establishedmodel of computation by anonymous, identical finite state agents. A protocol is well-specified if from every initial configuration, all fair executions of the protocol reach a common consensus. The central verification question for population protocols is the well-specification problem: deciding if a given protocol is well-specified. Esparza et al. hav...
متن کاملGuidelines for Verification of Population Protocols
We address the problem of verification by modelchecking of basic population protocol (PP) model of Angluin et al. This problem has received special attention the last two years and new tools have been proposed to deal with. We show that the problem can be solved using the existing modelchecking tools, e.g., Spin and Prism. For this, we apply the counting abstraction to obtain an abstract model ...
متن کاملVerification of Parameterized Protocols
Recently there has been much interest in the automatic and semi-automatic veri cation of parameterized networks, i.e., veri cation of a family of systems fPi j i 2 !g, where each Pi is a network consisting of i processes. In this paper, we present a method for the veri cation of so-called universal properties of fair parameterized networks of similar processes, that is, properties of the form 8...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Informatica
سال: 2016
ISSN: 0001-5903,1432-0525
DOI: 10.1007/s00236-016-0272-3